Ela Distance Spectral Radius of Trees with Fixed Maximum Degree∗
نویسندگان
چکیده
Abstract. Distance energy is a newly introduced molecular graph-based analog of the total π-electron energy, and it is defined as the sum of the absolute eigenvalues of the molecular distance matrix. For trees and unicyclic graphs, distance energy is equal to the doubled value of the distance spectral radius. In this paper, we introduce a general transformation that increases the distance spectral radius and provide an alternative proof that the path Pn has the maximal distance spectral radius among trees on n vertices. Among the trees with a fixed maximum degree ∆, we prove that the broom Bn,∆ (consisting of a star S∆+1 and a path of length n − ∆ − 1 attached to an arbitrary pendent vertex of the star) is the unique tree that maximizes the distance spectral radius, and conjecture the structure of a tree which minimizes the distance spectral radius. As a first step towards this conjecture, we characterize the starlike trees with the minimum distance spectral radius.
منابع مشابه
Ela Some Results on the Spectral Radii of Trees, Unicyclic, and Bicyclic Graphs
Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...
متن کاملEla the P -laplacian Spectral Radius of Weighted Trees with a Degree Sequence and a Weight Set∗
In this paper, some properties of the discrete p-Laplacian spectral radius of weighted trees have been investigated. These results are used to characterize all extremal weighted trees with the largest p-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight set. Moreover, a majorization theorem with two tree degree sequences is presented.
متن کاملOn extremal trees with respect to their terminal distance spectral radius
Let G be a simple connected graph. The terminal distance matrix of G is the distance matrix between all pendant vertices of G. In this paper, we introduce some general transformations that increase the terminal distance spectral radius of a connected graph and characterize the extremal trees with respect to the terminal distance spectral radius among all trees with a fixed number of pendant ver...
متن کاملTrees with given maximum degree minimizing the spectral radius
The spectral radius of a graph is the largest eigenvalue of the adjacency matrix of the graph. Let T (n,∆, l) be the tree which minimizes the spectral radius of all trees of order n with exactly l vertices of maximum degree ∆. In this paper, T (n,∆, l) is determined for ∆ = 3, and for l ≤ 3 and n large enough. It is proven that for sufficiently large n, T (n, 3, l) is a caterpillar with (almost...
متن کامل